7. Acknowledgments 8. References 6. Concluding Remarks
نویسنده
چکیده
Optimal algorithms for computing the minimum distance between two finite planar sets, " Proc. A fast algorithm for the planar convex hull problem, " internal manuscript, [25] B. K. Bhattacharya and G. T. Toussaint. " A time-and-storage efficient implementation of an optimal planar convex hull algorithm, " Divide and conquer for linear expected time, " Inform. A linear algorithm for finding the convex hull of a simple polygon, " Inform. Applications of a two-dimensional hidden-line algorithm to other geometric problems, " Tech. [17] J. L. Bentley, et al., " On the average number of maxima in a set of vectors and applications , " [18] L. Devroye, " A note on finding convex hulls via maximal vectors, " Inform. [20] R. Graham, " An efficient algorithm for determining the convex hull of a planar set, " Inform .It should be noted that if metrics other than the euclidean are used, then the O(n log n) complexity can be reduced for the set-of-points problem. In [13] it is shown that with the L 1 and L ∞ metrics, the maximum distance between two arbitrary sets of points can be computed in O(n) worst-case time in two dimensions. Furthermore, in d dimensions the L ∞ maximum distance can be computed in O(nd) worst-case time. Finally, we note that for the euclidean metric we can obtain O(n) expected running time for any fixed dimensions d with a slight modification of the algorithm MAXDIST-1. Lemma 2.1 generalizes to higher dimensions. Furthermore, the 2 d sets of maximal vectors [17] of S i are a superset of the vertices of the convex hull of S i. Thus in the modified versions of MAXDIST-1 we first find the maximal vector sets S mi of S i , i = 1, 2 and then we use BRUTE-FORCE to compute d max (S m1 , S m2). Bentley et al. [17] have shown that the maximal vectors can be found in O(n) expected time whenever the underlying density f can be written as a d-fold product of densities: f(x 1 ,..., x d) =. These are very general conditions which are satisfied for example for the normal density. Furthermore, Devroye [18] has shown that, under the above condition, if an O(n p) (p ≥ 1) algorithm is used on the resulting set of maximal vectors the algorithm has average complexity O(n). Since computing the maximum distance by BRUTE-FORCE …
منابع مشابه
AMPK by exercise 4. Allosteric and covalent regulation of AMPK activity 5. Nucleotide dependent activation of AMPK 6. Calcium dependent activation of AMPK 7. Muscle glycogen dependent activation of AMPK 8. Reactive oxygen species dependent activation of AMPK
1. Abstract 2. Introduction 3. Activation of skeletal muscle AMPK by exercise 4. Allosteric and covalent regulation of AMPK activity 5. Nucleotide dependent activation of AMPK 6. Calcium dependent activation of AMPK 7. Muscle glycogen dependent activation of AMPK 8. Reactive oxygen species dependent activation of AMPK 9. TAK1 – a cytokine dependent AMPK regulator? 10. Concluding remarks 11. Ack...
متن کاملUpdate 1 of: Protection (and Deprotection) of Functional Groups in Organic Synthesis by Heterogeneous Catalysis.
2.7. Redox Deprotections 221 3. Thiol Protecting Groups 223 4. Carboxy Protecting Groups 223 4.1. Protection 224 4.2. Deprotection 226 5. Carbonyl Protecting Groups 227 5.1. Acetals 227 5.1.1. Protection 227 5.1.2. Deprotection 231 5.2. Dithioacetals 233 5.2.1. Protection 233 5.2.2. Deprotection 235 5.3. 1,3-Oxathiolanes 237 5.4. 1,1-Diacetates (Acylals) 238 5.4.1. Protection 238 5.4.2. Deprote...
متن کاملSubtilisin Structure and Catalysis in Non - Aqueous Media
................................................................................................. 3 Acknowledgments ................................................................................. 5 Introduction ............................................................................. 7 I. The Crystal Structure of Subtilisin Carlsberg in Anhydrous Dioxane and Its Comparison with Those in W...
متن کاملNeurobiological applications of small molecule screening.
2.2.1. High-Throughput Screening in vitro 1778 2.2.2. Cell-Based Screening Methods 1779 2.2.3. Tissue-Explant-Based Screens 1780 2.2.4. Organismal Model Systems 1780 2.3. Assay Detection Methods 1781 2.3.1. Spectroscopic Methods 1781 2.3.2. High-Content Screening 1781 3. Target Validation 1782 3.1. Affinity Chromatography 1782 3.2. Protein and Small Molecule Microarrays 1782 3.3. Classical Gene...
متن کاملA Panel Data Study of Physicians’ Labor Supply: The Case of Norway
.................................................................................... 4 SAMMENDRAG ................................................................................. 5 INTRODUCTION................................................................................ 7 Background .................................................................................................. 8 Economet...
متن کاملErgodic Theory: Nonsingular Transformations
Glossary 1 1. Definition of the subject and its importance 2 2. Basic Results 2 3. Panorama of Examples 8 4. Mixing notions and multiple recurrence 10 5. Topological group Aut(X,μ) 13 6. Orbit theory 15 7. Smooth nonsingular transformations 21 8. Spectral theory for nonsingular systems 22 9. Entropy and other invariants 25 10. Nonsingular Joinings and Factors 27 11. Applications. Connections wi...
متن کامل